A discrete-time queueing model of the shared buffer ATM switch with bursty arrivals
نویسندگان
چکیده
Ve model the shared buffer ATM switch as a discrete-time queueing system. The arrival process to each port of the ATM switch. is assumed to be bursty and it is modelled by an Interrupted Bernoulli Process. The discrete-time queueing system is analyzed approximately. It is first decomposed into subsystems, and then each subsystem is analyzed separately. The results from the subsystems are combined together through an iterative scheme. The analysis of each subsystem involves the contruction of the superposition of all the arrival processes to the switch. Comparisons against simulation data showed that the approximate results have a good accuracy.
منابع مشابه
Analysis of Discrete-Time Server Queues with Bursty Markovian Inputs
We study a discrete-time deterministic server queue with infinite buffer and with packet arrivals that depend on a multidimensional Markov process. Using the generating functions approach we give a means for obtaining the boundary conditions vector for the case where the value zero is a multiple eigenvalue of the problem. We also derive recursive form expressions for the direct determination of...
متن کاملApproximate Analysis of a Shared-Medium ATM Switch Under Bursty Arrivals and Nonuniform Destinations
In this paper, we present an approximate analysis of a generic shared-medium A TM switch with input and output queueing. Input traffic is assumed to be bursty and is modelled by an Interrupted Bernoulli Process (IBP). Three different bus service policies are analyzed: Time Division Multiplexing (TDA1), Cyclic, and Random. The output links may have constant or geometric service time. The analysi...
متن کاملMulticast ATM Switches Using Buffered MIN Structure: A Performance Study
A (large) multicast ATM switch with external structure of output queueing and internal structure of buflered MINs (multistage interconnection networks) M considered, where the buffered MIN (also called switching network) is composed of switching elements with shared buffer output queueing. Cell replication wht!e routing scheme is used in the switch to implement multicast function. In this paper...
متن کاملAnalytical Modelling of Shared Buffer ATM Switches with Hot-Spot Pushout under Bursty Traffic
Asynchronous Transfer Mode (ATM) shared buffer switches have numerous advantages such as relatively high throughput and good buffer utilization, and they are increasingly favoured in recent VLSI switch designs. But under nonuniform traffic, the performance degrades dramatically due to the monopolization of the buffer by some favoured cells. To overcome this, restricted types of sharing and Hot-...
متن کاملMaximum Entropy Analysis of Queueing Network Models
The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of tree expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuoustime and discrete-time Queu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Telecommunication Systems
دوره 2 شماره
صفحات -
تاریخ انتشار 1993